[Problem Link] Use a typical 2 pointer approach to solve this problem. At step 1 assume your max container spans two ends. What is the area of a container given i and j? It is the width of the container (j-i) x height of the container (which is bounded by the min(heights[i], heights[j]). Moving which … Continue reading [Leetcode] Container With Most Water